An Archived Multi Objective Simulated Annealing Method to Discover Biclusters in Microarray Data

With the advent of microarray technology it has been possible to measure thousands of expression values of genes in a single experiment. Analysis of large scale geonomics data, notably gene expression, has initially focused on clustering methods. Recently, biclustering techniques were proposed for revealing submatrices showing unique patterns. Biclustering or simultaneous clustering of both genes and conditions is challenging particularly for the analysis of high-dimensional gene expression data in information retrieval, knowledge discovery, and data mining. In biclustering of microarray data, several objectives have to be optimized simultaneously and often these objectives are in conflict with each other. A multi objective model is very suitable for solving this problem. Our method proposes a algorithm which is based on multi objective Simulated Annealing for discovering biclusters in gene expression data. Experimental result in bench mark data base present a significant improvement in overlap among biclusters and coverage of elements in gene expression and quality of biclusters

The application of Ants' society algorithm for Management of resources in continuous bilateral auction

Background: The main purpose of this paper is to improve the efficiency of grid computing by means of Ants' society algorithm. Application of this algorithm in various problem led to an improvement in efficiency and reduction in processing time. This enables us to use this algorithm in grid computing. Economic solutions in the field of management of heterogeneous resources for grid computing showed significant performance. The main idea was economic solutions for product exchange in market. This paper aims to introduce a new method for bilateral auction scenario by means of genetic algorithm (GA). In this method, by making resources intelligent, we move the packages of call for proposal so that it can reduce response time as well as being able to supply resources with lower prices. For simplicity in controlling packages, we used the network structure in implementation. Applied structure includes routers and communication of users and auctioners and auctioners and resources owners. The method was implemented using GridSim simulator. This is an open source software written in Java programming language. Results reveal that the method of bilateral auction using GA reduces sale stages and consequently leads to faster responding to requests and also resources are supplied with a lower cost

Logo Detection Using Pose Clustering and Momentums

Nowadays, logo and arm detection with growing variety and number of arms in companies and countries is one of the significant topics in image processing. For logo detection there are many image processing algorithms which can be used for this purpose regard to features of the logo. In the most of recent works, images are exactly the logos, but in general, the logo can be one portion of another image or even can transform (rotate, skew, shift, …) and have more complexity. In this paper we will select Iran logo as a sample, because it has not any regular geometric form and has special complexity. In a bank of images we will try to find this logo and its position with its transformation. Images bank includes images that has not Iran logo or has Iran logo with affine transform within another pictures. Approaches that will be discussed here are pose clustering and momentum clustering. Simulation results show that this approach can be used as a suitable way for finding the existence and position of arm in this field